Compactness and convergence rates in the combinatorial integral approximation decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial integral approximation

We are interested in structures and efficient methods for mixed-integer nonlinear programs (MINLP) that arise from a first discretize, then optimize approach to timedependent mixed-integer optimal control problems (MIOCPs). In this study we focus on combinatorial constraints, in particular on restrictions on the number of switches on a fixed time grid. We propose a novel approach that is based ...

متن کامل

The Lagrangian relaxation for the combinatorial integral approximation problem

We are interested in methods to solve mixed-integer nonlinear optimal control problems (MIOCPs) constrained by ordinary differential equations and combinatorial constraints on some of the control functions. To solve these problems we use a first discretize, then optimize approach to get a specially structured mixed-integer nonlinear program (MINLP). We decompose this MINLP into an NLP and an MI...

متن کامل

Progressive iterative approximation and bases with the fastest convergence rates

All normalized totally positive bases satisfy the progressive iterative approximation property. The normalized B-basis has optimal shape preserving properties and we prove that it satisfies the progressive iterative approximation property with the fastest convergence rates. A similar result for tensor product surfaces is also derived. © 2006 Elsevier B.V. All rights reserved.

متن کامل

Distributed Statistical Estimation and Rates of Convergence in Normal Approximation

This paper presents new algorithms for distributed statistical estimation that can take advantage of the divide-and-conquer approach. We show that one of the key benefits attained by an appropriate divide-and-conquer strategy is robustness, an important characteristic of large distributed systems. We introduce a class of algorithms that are based on the properties of the geometric median, estab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2020

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-020-01598-8